- JGAA
- abbr.Journal of Graph Algorithms and Applications
Dictionary of abbreviations. 2012.
JGAA
Look at other dictionaries:
War FTP Daemon — (often called warftp or warftpd) is a free FTP server for Windows. When it was first released in 1996, it was the first free FTP server on this software platform. Warftpd has received lots of awards over the years, and is still popular, even if… … Wikipedia
Planar graph — Example graphs Planar Nonplanar Butterfly graph K5 The complete graph K4 … Wikipedia
Hypergraph — An example hypergraph, with X = {v1,v2,v3,v4,v5,v6,v7} and E = {e1,e2,e3,e4} = {{v1,v2,v3}, {v2,v3} … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… … Wikipedia
Cubic graph — Not to be confused with graphs of cubic functions. The Petersen graph is a Cubic graph … Wikipedia
Maximal independent set — This article is about the combinatorial aspects of maximal independent sets of vertices in a graph. For other aspects of independent vertex sets in graph theory, see Independent set (graph theory). For other kinds of independent sets, see… … Wikipedia
Probabilistic latent semantic analysis — (PLSA), also known as probabilistic latent semantic indexing (PLSI, especially in information retrieval circles) is a statistical technique for the analysis of two mode and co occurrence data. PLSA evolved from Latent semantic analysis, adding a… … Wikipedia
No-three-in-line problem — A set of 20 points in a 10 × 10 grid, with no three points in a line. In mathematics, in the area of discrete geometry, the no three in line problem, introduced by Henry Dudeney in 1917, asks for the maximum number of points that can be placed in … Wikipedia
Schnyder's theorem — In mathematics, Schnyder s theorem in graph theory is a planarity characterization for graphs in termsof the order dimension of their incidence posets.The incidence poset P(G) of a graph G with vertex set V and edge set E is the partially ordered … Wikipedia
